Sprachtheoretische Grundlagen F Ur Die Computer Linguistik Frank Morawietz : Monadic Second Order Logic, Tree Automata and Constraint Logic Programming Monadic Second Order Logic, Tree Automata and Constraint Logic Programming

In this paper we present a rst step toward the development of a constraint logic programming (clp) language R(MSO) based on monadic second order (mso) logic. We apply the scheme proposed by HH ohfeld and Smolka (1988) to obtain a relational extension of mso logic with a corresponding sound and complete operational semantics. The solutions to constraints expressed in monadic second order logic are represented by tree automata recognizing the assignment trees satisfying the formulas. Since this allows a compact and ee-cient representation of constraints, we can use mso theorem provers as constraint solvers for the clp interpreter. Building on the detailed investigationof mso logic in Rogers (1994) as a tree description language in the Principles and Parameter (P&P) paradigm, we present as motivation and applications details from the realm of P&P-based parsing.